Path graph

Results: 1083



#Item
311Tree decomposition / Graph / Dynamic programming / Tree / Shortest path problem / Path decomposition / Planar separator theorem / Graph theory / Mathematics / Theoretical computer science

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Application of computational geometry to network p-center location problems Binay Bhattacharya

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:10:51
312NP-complete problems / Hamiltonian path / Vertex cover / Independent set / Matching / Minimum spanning tree / Dominating set / Graph coloring / Theoretical computer science / Graph theory / Mathematics

CCCG 2011, Toronto ON, August 10–12, 2011 Euclidean Movement Minimization Nima Anari∗ MohammadAmin Fazli†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:16
313Theoretical computer science / Networks / Degree distribution / Traceroute / Topology / Shortest path problem / Network science / IEEE 802.1aq / Graph theory / Network theory / Mathematics

Complex Network Metrology Jean-Loup Guillaume Matthieu Latapy – CNRS – Université Paris 7, 2 place Jussieu, 75005 Paris, France

Add to Reading List

Source URL: www.complex-systems.com

Language: English - Date: 2012-09-20 14:36:40
314NP-complete problems / Bidimensionality / Parameterized complexity / Kernelization / Branch-decomposition / Path decomposition / Tree decomposition / Clique / Feedback vertex set / Graph theory / Theoretical computer science / Mathematics

Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 3, MayWelcome

Add to Reading List

Source URL: www.mrfellows.net

Language: English - Date: 2009-09-04 06:03:09
315Mazes / Algorithms / Spanning tree / Puzzles / Maze generation algorithm / Maze / Hamiltonian path / NP-complete / Maze solving algorithm / Graph theory / Theoretical computer science / Mathematics

CCCG 2009, Vancouver, BC, August 17–19, 2009 How to make a picturesque maze Yoshio Okamoto∗† Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2009-09-02 14:33:29
316Hypergraph / Combinatorics / Vertex cover / Graph / Incidence matrix / Planar graph / Path decomposition / Line graph / Graph theory / Mathematics / NP-complete problems

CCCG 2011, Toronto ON, August 10–12, 2011 Approximating the Obstacle Number for a Graph Drawing Efficiently∗ Deniz Sarı¨oz† Abstract

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:12
317Geometric graph theory / Topological graph theory / Graph coloring / Edge coloring / Path decomposition / Graph theory / Graph drawing / Planar graphs

Experiments on Area Compaction Algorithms for Orthogonal Drawings Carla Binucci †

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-07-31 13:55:53
318Network theory / NP-complete problems / Shortest path problem / Steiner tree problem / Routing algorithms / Graph theory / Theoretical computer science / Mathematics

Approximate Shortest Descent Path on a Terrain Sasanka Roy∗, Sachin Lodha†, Sandip Das‡ and Anil Maheshwari§ Abstract A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:25:54
319Polyhedron / Octahedron / Eulerian path / Induced path / Matching / Route inspection problem / Line graph / Edge coloring / Graph theory / Planar graphs / NP-complete problems

Computational Balloon Twisting: The Theory of Balloon Polyhedra Erik D. Demaine∗ Martin L. Demaine∗

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:08:28
320Graph theory / Homotopy / Metric geometry / Geodesic / Out / Simple-homotopy equivalence / Shortest path problem / Path / Planar graph / Topology / Mathematics / Homotopy theory

CCCG 2009, Vancouver, BC, August 17–19, 2009 On the Height of a Homotopy Erin W. Chambers∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2009-09-02 14:32:43
UPDATE